Automatic STG Derivation with Consideration of Special Properties of STG-Based Asynchronous Logic Synthesis

State - based STG implementability properties

State coding connict detection is a fundamental part of synthesis of asynchronous concurrent systems from their speciications as Signal Transition Graphs (STGs), which are a special kind of labelled Petri nets. The paper develops a method for identifying state coding connicts in STGs that is intended to work within a new synthesis framework based on Petri net unfolding. The latter ooers potenti...

COMPUTING SCIENCE Logic Decomposition of Asynchronous Circuits Using STG Unfoldings

A technique for logic decomposition of asynchronous circuits which works on STG unfolding prefixes rather than state graphs is proposed. It retains all the advantages of the state space based approach, such as the possibility of multiway acknowledgement, latch utilisation and highly optimised circuits. Moreover, it significantly alleviates the state space explosion, and thus has superior memory...

Veriication Driven Synthesis of Asynchronous Circuits from Stg Speciication

STG-Based Synthesis of Speed- Independent CMOS Cells

This paper presents a method for designing speed-independent sequential cells from signal transition graphs (STG). The initial STG is assumed to satisfy the complete state coding property (CSC). It is modified by introducing auxiliary signals to satisfy the rule of alternate up and down transitions for CMOS circuits, as well as other rules derived from the properties of negative gates. Two desi...

Combining Decomposition and Unfolding for STG Synthesis

For synthesising efficient asynchronous circuits one has to deal with the state space explosion problem. In this paper, we present a combined approach to alleviate it, based on using Petri net unfoldings and decomposition. The experimental results show significant improvement in terms of runtime compared with other existing methods.